منابع مشابه
Narrow-Linewidth Distributed Feedback Channel
We report on the fabrication and characterization of a distributed feedback channel waveguide laser in erbium-doped aluminium oxide on a standard thermally oxidized silicon substrate. Holographically-written surface-relief Bragg gratings have been integrated with the aluminium oxide waveguides via reactive ion etching of a silicon dioxide overlay film. The laser operates at a wavelength of 1545...
متن کاملDistributed Energy Efficient Channel Allocation
In the last few years the issue of energy-efficient network design has gained increasingly more importance [1], [2], both in academia and in industry. Information and communication technologies (ICT) represent about 2% of the entire world’s energy consumption, and the situation is likely to reach a point where ICT equipments in large cities will require more energy than is actually available [3...
متن کاملDistributed Computing with Channel Noise
A group of n users want to run a distributed protocol π over a network where communication occurs via private point-to-point channels. Unfortunately, an adversary, who knows π, is able to maliciously flip bits on the channels. Can we efficiently simulate π in the presence of such an adversary? We show that this is possible, even when L, the number of bits sent in π, and T , the number of bits f...
متن کاملDistributed Priority Synthesis
Given a set of interacting components with non-deterministic variable update and given safety requirements, the goal of priority synthesis is to restrict, by means of priorities, the set of possible interactions in such a way as to guarantee the given safety conditions for all possible runs. In distributed priority synthesis we are interested in obtaining local sets of priorities, which are dep...
متن کاملSynthesis of Distributed Systems
This thesis offers a comprehensive solution of the distributed synthesis problem. It starts with the problem of solving Parity games, which form an integral part of the automata-theoretic synthesis algorithms we use. We improve the known complexity bound for solving parity games with n positions and c colors approximately from O(n 1 2 ) to O(n 1 3 ), and introduce an accelerated strategy improv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2279330